Probabilistic QoS Guarantees: Fixed and Dynamic Priority Scheduling
نویسندگان
چکیده
Generally, with a limited number of fixed priorities ( ) within a network, applications sharing a same priority are scheduled according to First in First out ( I O) discipline. This policy is called FP/FIFO. However real time applications have deadline requirements which aren’t taken into account with the I O discipline. That is why we propose to introduce the Earliest Deadline First ( D ) discipline to schedule applications sharing a same priority.
منابع مشابه
FP/FIFO Scheduling: Coexistence of Deterministic and Probabilistic QoS Guarantees
In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-to-end response time (or jitter). We propose a solution allowing the coexistence of two types of quantitative QoS guarantees, deterministic and probabilistic, while providing high resource utilization. Our solution combines the advantages of both the deterministic and the probabilistic a...
متن کاملReal-time-service-based Distributed Scheduling Scheme for IEEE 802.16j Networks
Supporting Quality of Service (QoS) guarantees for diverse multimedia services is the primary concern for IEEE802.16j networks. A scheduling scheme that satisfies the QoS requirements has become more important for wireless communications. We proposed an adaptive nontransparent-based distributed scheduling scheme (ANDS) for IEEE 802.16j networks. ANDS comprises three major components: Priority A...
متن کاملProbabilistic QoS Guaranties and local scheduling studies in a Bluetooth piconet
To ensure efficient communication in Bluetooth networks, there must be a good design of intra and inter-piconet scheduling solutions. We present a mathematical model for performance evaluation of a Bluetooth piconet, based on the M/G/1 queue with batch arrivals and vacation times. We introduce a scheduling scheme that supports various traffics with QoS guaranties. We deal with two application c...
متن کاملFixed-priority scheduling algorithms with multiple objectives in hard real-time systems
In the context of Fixed-Priority Scheduling in Real-Time Systems, we investigate scheduling mechanisms for supporting systems where, in addition to timing constraints, their performance with respect to additional QoS requirements must be improved. This type of situation may occur when the worst-case resource requirements of all or some running tasks cannot be simultaneously met due to task cont...
متن کاملIntegrating Best-Effort Policies into Hard Real-Time Systems based on Fixed Priority Pre-emptive Scheduling
Analysis provided for fixed priority pre-emptive scheduling enables a priori guarantees to be given regarding the timing requirements of critical tasks. By comparison, Best-Effort scheduling maximises system utility, but at best provides only probabilistic guarantees that time constraints will be met. In this paper, we show how these two schemes can be integrated. A new Adaptive Value-Density T...
متن کامل